Hierarchical Models, Marginal Polytopes, and Linear Codes
نویسندگان
چکیده
In this paper, we explore a connection between binary hierarchical models, their marginal polytopes and codeword polytopes, the convex hulls of linear codes. The class of linear codes that are realizable by hierarchical models is determined. We classify all full dimensional polytopes with the property that their vertices form a linear code and give an algorithm that determines them.
منابع مشابه
ar X iv : 0 80 5 . 13 01 v 1 [ m at h . ST ] 9 M ay 2 00 8 Hierarchical Models , Marginal Polytopes , and Linear Codes
In this paper, we explore a connection between binary hierarchical models, convex geometry, and coding theory. Using the so called moment map, each hierarchical model is mapped to a convex polytope, the marginal polytope. We realize the marginal polytopes as 0/1-polytopes and show that their vertices form a linear code. We determine a class of linear codes that is realizable by hierarchical mod...
متن کاملNeighborliness of Marginal Polytopes
A neighborliness property of marginal polytopes of hierarchical models, depending on the cardinality of the smallest non-face of the underlying simplicial complex, is shown. The case of binary variables is studied explicitly, then the general case is reduced to the binary case. A Markov basis for binary hierarchical models whose simplicial complexes is the complement of an interval is given.
متن کاملLinear Programming, the Simplex Algorithm and Simple Polytopes
In the first part of the paper we survey some far reaching applications of the basis facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concurring the simplex algorithm. We describe sub-exponential randomized pivot roles and upper bounds on the diameter of graphs of polytopes.
متن کاملSolving multiobjective linear programming problems using ball center of polytopes
Here, we aim to develop a new algorithm for solving a multiobjective linear programming problem. The algorithm is to obtain a solution which approximately meets the decision maker's preferences. It is proved that the proposed algorithm always converges to a weak efficient solution and at times converges to an efficient solution. Numerical examples and a simulation study are used to illu...
متن کاملMarginal conditional independence models with application to graphical modeling
Conditional independence models are defined by a set of conditional independence restrictions and play an important role in many statistical applications, especially, but not only, graphical modeling. In this paper we identify a subclass of these models which are hierarchical marginal log-linear, as defined by Bergsma and Rudas (2002a). Such models are smooth, which implies the applicability of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Kybernetika
دوره 45 شماره
صفحات -
تاریخ انتشار 2009